Some remarks on the Shannon capacity of odd cycles
نویسندگان
چکیده
We tackle the problem of estimating the Shannon capacity of cycles of odd length. We present some strategies which allow us to nd tight bounds on the Shannon capacity of cycles of various odd lengths, and suggest that the diiculty of obtaining a general result may be related to diierent behaviours of the capacity, depending on the \structure" of the odd integer representing the cycle length. We also describe the outcomes of some experiments, from which we derive the evidence that the Shannon capacity of odd cycles is extremely close to the value of the Lovv asz theta function.
منابع مشابه
A Limit Theorem for the Shannon Capacities of Odd Cycles I
This paper contains a construction for independent sets in the powers of odd cycles. It follows from this construction that the limit as n goes to infinity of n+ 1/2−Θ(C2n+1) is zero, where Θ(G) is the Shannon capacity of the graph G.
متن کاملA nontrivial lower bound on the Shannon capacities of the complements of odd cycles
This paper contains a construction for independent sets in the powers of the complements of odd cycles. In particular, we show that α ( C 2 2n+3 ) ≥ 22n + 1. It follows that for n ≥ 0 we have Θ(C2n+3) > 2, where Θ(G) denotes the Shannon capacity of graph G.
متن کاملA Limit Theorem for the Shannon Capacities of Odd Cycles. Ii
It follows from a construction for independent sets in the powers of odd cycles given in the predecessor of this paper that the limit as k goes to infinity of k+ 1/2−Θ(C2k+1) is zero, where Θ(G) is the Shannon capacity of a graph G. This paper contains a shorter proof of this limit theorem that is based on an ‘expansion process’ introduced in an older paper of L. Baumert, R. McEliece, E. Rodemi...
متن کاملNew lower bounds for the Shannon capacity of odd cycles
The Shannon capacity of a graphG is defined as c(G) = supd≥1(α(G )) 1 d , where α(G) is the independence number of G. The Shannon capacity of the cycle C5 on 5 vertices was determined by Lovász in 1979, but the Shannon capacity of a cycle Cp for general odd p remains one of the most notorious open problems in information theory. By prescribing stabilizers for the independent sets in C p and usi...
متن کاملCombinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Ashik Mathew Kizhakkepallathu Name of the doctoral dissertation Combinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 112/2015 Field of research Info...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 66 شماره
صفحات -
تاریخ انتشار 2003